⚡️ Speed up function sorter by 57,106%
#86
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
📄 57,106% (571.06x) speedup for
sorterincode_to_optimize/bubble_sort.py⏱️ Runtime :
368 milliseconds→643 microseconds(best of698runs)📊 Benchmark Performance Details
📝 Explanation and details
Certainly! The given program uses bubble sort, which has an average and worst-case time complexity of (O(n^2)). We can optimize this by using a more efficient sorting algorithm like Timsort, which is the default sorting algorithm used in Python's
sorted()method andlist.sort()method. Timsort has a time complexity of (O(n \log n)).Here's the modified code.
This code calls the
arr.sort()method that sorts the list in place using Timsort, making it significantly faster for larger lists.✅ Correctness verification report:
🌀 Generated Regression Tests Details
To edit these changes
git checkout codeflash/optimize-sorter-m8q8mgeoand push.